A Determinant Identity that Implies Rogers-Ramanujan

A Determinant Identity that Implies Rogers-Ramanujan

We give a combinatorial proof of a general determinant identity for associated polynomials. This determinant identity, Theorem 2.2, gives rise to new polynomial generalizations of known Rogers-Ramanujan type identities. Several examples of new Rogers-Ramanujan type identities are given.

Rogers-Ramanujan computer searches

We describe three computer searches (in PARI/GP, Maple, and Mathematica, respectively) which led to the discovery of a number of identities of Rogers-Ramanujan type and identities of false theta functions.

New Finite Rogers-Ramanujan Identities

We present two general finite extensions for each of the two Rogers-Ramanujan identities. Of these one can be derived directly from Watson’s transformation formula by specialization or through Bailey’s method, the second similar formula can be proved either by using the first formula and the q-Gosper algorithm, or through the so-called Bailey lattice.

Finite Rogers-Ramanujan Type Identities

Polynomial generalizations of all 130 of the identities in Slater’s list of identities of the Rogers-Ramanujan type are presented. Furthermore, duality relationships among many of the identities are derived. Some of the these polynomial identities were previously known but many are new. The author has implemented much of the finitization process in a Maple package which is available for free do...

Math 7012 Enumerative Combinatorics Project: Introduction to a combinatorial proof of the Rogers-Ramanujan and Schur identities and an application of Rogers-Ramanujan identity